2 <TITLE>Linear probing sort
7 <A HREF="../../images/handbook.gif"><IMG SRC="../../images/handbook2.gif" align=left></A>
8 <A HREF="../../hbook.html">
9 <IMG SRC="../../images/home_g.gif" hspace = 15 vspace = 4 ALT = "[Home]"></A><BR>
10 <A HREF="../../sort_a.html">
11 <IMG SRC="../../images/chapter_g.gif" hspace = 15 vspace = 4 ALT = "[Chapter]"></A><BR>
12 <A HREF="../../expand.html">
13 <IMG SRC="../../images/contents_g.gif" hspace = 15 vspace = 4 ALT = "[Contents]"></A><BR>
14 <A HREF="417.sort.c.html">
16 <A HREF="417.sort.c.html">
17 <IMG SRC="../../images/prevalg_g.gif" hspace = 15 vspace = 4 ALT = "[Previous Algorithm]"></A><BR>
18 <A HREF="42.char.c.html">
19 <IMG SRC="../../images/nextalg_g.gif" hspace = 15 vspace = 4 ALT = "[Next Algorithm]"></A><BR>
22 <H2><B>Linear probing sort
31 procedure sort( var r : ArrayToSort; lo, up : integer );
37 for j:=lo to UppBoundr do r[j].k := NoKey;
38 for j:=lo to up do begin
39 i := phi(r1[j].k,lo,m);
40 while r[i].k <> NoKey do begin
41 if r1[j].k < r[i].k then begin
47 if i > UppBoundr then Error
52 for j:=lo to UppBoundr do
53 if r[j].k <> NoKey then begin
57 for j:=i+1 to UppBoundr do r[j].k := NoKey;
59 </XMP></TD></TR></TABLE>
61 <H3><A HREF="ftp://sunsite.dcc.uchile.cl/pub/users/rbaeza/handbook/algs/4/417.sort.c"><IMG SRC="../../images/ftp.xbm" hspace=10>C</A> source (417.sort.c) <A HREF="ftp://sunsite.dcc.uchile.cl/pub/users/rbaeza/handbook/algs/4/417.sort.p"><IMG SRC="../../images/ftp.xbm" hspace=10>Pascal</A> source (417.sort.p)
64 <IMG SRC="../../images/aw3.gif" align=left><H5><BR>
65 © <A HREF="http://aw.com">Addison-Wesley </A>Publishing Co. Inc.